/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
ll dp[1000010];
set<ll> st;
int main()
{
    dp[1] = 1;
    dp[2] = 4;
    dp[3] = 2;
    dp[4] = 3;
    dp[5] = 2;
    for (int i = 6; i <= 100; i++)
    {
        dp[i] = 0;
        for (int j = 1; j <= 5; j++)
        {
            dp[i] += dp[j] * dp[i - j];
            dp[i] %= 1000000007;
        }
        if (st.count(dp[i]) > 0)
            printf("%d\n", i);
        st.insert(dp[i]);
    }
    putchar('a');
    getchar();
    getchar();
    return 0;
}
